Skip to main content

A recursively defined ordering for proving termination of term rewriting systems

Item Preview

texts
A recursively defined ordering for proving termination of term rewriting systems


Publication date 1978
Publisher Urbana : Dept. of Computer Science, University of Illinois at Urbana-Champaign
Collection university_of_illinois_urbana-champaign; americana
Digitizing sponsor University of Illinois Urbana-Champaign
Contributor University of Illinois Urbana-Champaign
Language English
Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 943
"UILU-ENG 78 1736."

NSF MCS 77-22830."

Bibliography: p. 53

Notes

No copyright or contents pages.

Full catalog record MARCXML

comment
Reviews

There are no reviews yet. Be the first one to write a review.
SIMILAR ITEMS (based on metadata)
University of Illinois Urbana-Champaign
by Peterson, Larry J; University of Illinois at Urbana-Champaign. Dept. of Computer Science
texts
eye 134
favorite 0
comment 0
University of Illinois Urbana-Champaign
by Kau, James B; Sirmans, C. F. joint author; University of Illinois at Urbana-Champaign. College of Commerce and Business Administration
texts
eye 206
favorite 0
comment 0
University of Illinois Urbana-Champaign
by Dershowitz, Nachum; National Science Foundation (U.S.); University of Illinois at Urbana-Champaign. Dept. of Computer Science
texts
eye 162
favorite 0
comment 0
University of Illinois Urbana-Champaign
by Plaisted, David A; University of Illinois at Urbana-Champaign. Department of Computer Science
texts
eye 93
favorite 0
comment 0
Arxiv.org
texts
eye 18
favorite 0
comment 0
Source: http://arxiv.org/abs/cs/0702040v1